Distance-Based Repairs of Databases
نویسندگان
چکیده
We introduce a general framework for repairing inconsistent databases by distance-based considerations. The uniform way of representing repairs and their semantics clarifies the essence behind various approaches to consistency restoration in database systems, helps to compare the underlying formalisms, and relates them to existing methods of defining belief revision operators, merging data sets, and integrating information systems.
منابع مشابه
Characterizing and Computing Causes for Query Answers in Databases from Database Repairs and Repair Programs
A correspondence between database tuples as causes for query answers in databases and tuple-based repairs of inconsistent databases with respect to denial constraints has already been established. In this work, answer-set programs that specify repairs of databases are used as a basis for solving computational and reasoning problems about causes. Here, causes are also introduced at the attribute...
متن کاملCausality in Databases: The Diagnosis and Repair Connections
In this work we establish and investigate the connections between causality for query answers in databases, database repairs wrt. denial constraints, and consistency-based diagnosis. The first two are relatively new problems in databases, and the third one is an established subject in knowledge representation. We show how to obtain database repairs from causes and the other way around. The vast...
متن کاملA graded approach to database repair by context-aware distance semantics
The problem of inconsistent information in databases often arises in the context of data integration and data exchange. In these areas the common assumption is that the real world is consistent, thus an inconsistent database does not correspond to any reliable state and it needs to be “repaired” according to a chosen policy. Many of these policies have to deal with the problem of an exponential...
متن کاملPriority-Based Conflict Resolution in Inconsistent Relational Databases
We study here the impact of priorities on conflict resolution in inconsistent relational databases. We extend the framework of [1], which is based on the notions of repair and consistent query answer. We propose a set of postulates that an extended framework should satisfy and consider two instantiations of the framework: (locally preferred) l -repairs and (globally preferred) g -repairs. We st...
متن کاملOn the Data Complexity of Consistent Query Answering over Graph Databases
Areas in which graph databases are applied – such as the semantic web, social networks and scientific databases – are prone to inconsistency, mainly due to interoperability issues. This raises the need for understanding query answering over inconsistent graph databases in a framework that is simple yet general enough to accommodate many of its applications. We follow the well-known approach of ...
متن کامل